Applying the Sparse Grid Combination Technique in Linear Gyrokinetics

نویسنده

  • Christoph Kowitz
چکیده

The coming large fusion experiment ITER will heavily benefit from numerical simulations. One model for simulating the hot plasmas occurring in such a device are the gyrokinetic equations, which can resolve the micro-turbulence in the plasma. Due to their moderately high dimensionality they could profit from using sparse grids. Since the highly efficient and paral-lelized simulation code GENE is already at hand, the sparse grid combination technique can be used to create sparse grid solutions. In this way, the full parallelism of GENE can be used and on top of it, another layer of parallelism is introduced. This approach can on the one hand be one step toward exascale computations, since it the parallelism acts on top of the current application. On the other hand it can also be used to reduce the effect of hardware faults, which will probably occur more often on exascale architectures. We will present some results of the combination technique for the special case of linear computations in GENE. For that the optimized combination technique is used, which allows to adapt the coefficients for combination to the underlying problem, which is in our case an eigenvalue problem. It computes its combination coefficients out of an optimization problem, which is also including the search for single eigenvalues of the system. In the end, the method will have retrieved an approximation of the eigenvalue and a representation of the eigenvector in the basis of the partial solutions used for combination. This method can also be generalized to other basis functions than the partial solutions and might thus be also employed for more general problems than the gyrokinetic eigenvalue problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique

Sparse grids are tailored to the approximation of smooth high-dimensional functions. On a d-dimensional cube, the number of grid points is N = O(h−1| log h|d−1) with a mesh size parameter h. The so-called combination technique, based on hierarchical decomposition, facilitates the numerical solution of partial differential equations on these grids. Key to the convergence analysis are specific mu...

متن کامل

A dimension adaptive sparse grid combination technique for machine learning

We introduce a dimension adaptive sparse grid combination technique for the machine learning problems of classification and regression. A function over a d-dimensional space, which assumedly describes the relationship between the features and the response variable, is reconstructed using a linear combination of partial functions who possibly depend only on a subset of all features. The partial ...

متن کامل

Solution of Time - dependent Advection - di usion Problems with the Sparse - grid Combination Technique and a Rosenbrock Solver

In the current paper the e ciency of the sparse-grid combination technique applied to time-dependent advectiondi usion problems is investigated. For the time integration we employ a third-order Rosenbrock scheme implemented with adaptive step-size control and approximate matrix factorization. Two model problems are considered, a scalar 2D linear, constant-coe cient problem and a system of 2D no...

متن کامل

A Dimension Adaptive Combination Technique Using Localised Adaptation Criteria

We present a dimension adaptive sparse grid combination technique for the machine learning problem of regression. A function over a d-dimensional space, which assumedly describes the relationship between the features and the response variable, is reconstructed using a linear combination of partial functions; these may depend only on a subset of all features. The partial functions, which are pie...

متن کامل

A Combination Technique for the Solution of Sparse Grid Problems

Two-dimensional sparse grids contain only O(h ?1 log(h ?1)) grid points, in contrast to the usually used full O(h ?2)-grids, whereas for a suuciently smooth function the accuracy of the representation is only slightly deteriorated from O(h 2) to O(h 2 log(h ?1)). The combination technique presented in this paper uses the solutions of O(log(h ?1)) diierent, on regular standard grids discretized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016